Closures in Formal Languages: Concatenation, Separation, and Algorithms
نویسندگان
چکیده
We continue our study of open and closed languages. We investigate how the properties of being open and closed are preserved under concatenation. We investigate analogues, in formal languages, of the separation axioms in topological spaces; one of our main results is that there is a clopen partition separating two words if and only if the words commute. We show that we can decide in quadratic time if the language specified by a DFA is closed, but if the language is specified by an NFA, the problem is PSPACE-complete.
منابع مشابه
Closures in Binary Partial Algebras
Two procedures for computing closures in binary partial algebras (BPA) are introduced: a Fibonacci-style procedure for closures in associative BPAs, and a multistage procedure for closures in associative, commutative and idempotent BPAs. Ramifications in areas such as resolution theorem proving, graph-theoretic algorithms, formal languages and formal concept analysis are discussed. In particula...
متن کاملGeneric Results for Concatenation Hierarchies
In the theory of formal languages, the understanding of concatenation hierarchies of regular languages is one of the most fundamental and challenging topic. In this paper, we survey progress made in the comprehension of this problem since 1971, and we establish new generic statements regarding this problem.
متن کاملGeneral Multigenerative Grammar Systems
The formal language theory has intensively investigated various grammar systems (see [1], l2l, [8]), which consist of several cooperating components, usually represented by grammars. Although this variety is extremely broad, all these grammar systems always use a derivation that generates a single string. In this paper, however, we introduce grammar systems that simultaneously generate several ...
متن کاملComplexity of language equations with one-sided concatenation and all Boolean operations
Language equations are equations where both the constants occurring in the equations and the solutions are formal languages. They have first been introduced in formal language theory, but are now also considered in other areas of computer science. In particular, they can be seen as unification problems in the algebra of languages whose operations are the Boolean operations and concatenation. Th...
متن کاملAnchored Concatenation of MSCs
We study collections of Message Sequence Charts (MSCs) defined by High-level MSCs (HMSCs) under a new type of concatenation operation called anchored concatenation. We show that there is no decision procedure for determining if the MSC language defined by an HMSC is regular and that it is undecidable if an HMSC admits an implied scenario. Further, the languages defined by locally synchronized H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0901.3763 شماره
صفحات -
تاریخ انتشار 2009